Attribute-Based Equality Test Over Encrypted Data Without Random Oracles
نویسندگان
چکیده
منابع مشابه
Dynamic attribute-based signcryption without random oracles
In SCN2010, Gagné, Narayan, and Safavi-Naini proposed attribute-based signcryption (ABSC) with threshold structure. As in ciphertext-policy attribute-based encryption (CP-ABE), an encryptor can specify the access structure of decryptors, and as in attribute-based signature (ABS), each decryptor can verify the encryptor’s attributes. In contrast to the access structure of decryptors, the access ...
متن کاملIdentity-Based Verifiably Encrypted Signatures without Random Oracles
Fair exchange protocol plays an important role in electronic commerce in the case of exchanging digital contracts. Verifiably encrypted signatures provide an optimistic solution to these scenarios with an off-line trusted third party. In this paper, we propose an identity-based verifiably encrypted signature scheme. The scheme is non-interactive to generate verifiably encrypted signatures and t...
متن کاملRevocable Attribute-based Key Agreement Protocol without Random Oracles
In this paper, we present a two-party attributebased key agreement protocol, which is secure in the standard model (without random oracles), under the truncated decision q-ABDHE assumption. Then we give a modified version of this scheme, in which the users can be revoked efficiently. The attribute-based key agreement protocol is based on the attribute-based encryption scheme, which is a general...
متن کاملAn Expressive Attribute-based Signature Scheme without Random Oracles
Attribute-based signatures (ABS) is a new cryptographic primitive and can play a great role in attributebased access control systems. In ABS, a signer can choose its attributes satisfying a policy of a verifier to generate a valid signature without reveal its identity or attributes, while the signature assures that the message is endorsed by an individual owning attributes the policy requiring....
متن کاملAn Efficient Verifiably Encrypted Signature Scheme without Random Oracles
In this paper, we propose an efficient verifiably encrypted signature scheme based on bilinear pairings. The proposed scheme is proven secure without random oracles. Our scheme has a tight security reduction to a strong but reasonable computational assumption. To the best of our knowledge, it is the third one of this kind in the literature to achieve this security level.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2973459